PRAM programming: theory vs. practice
نویسندگان
چکیده
In this paper we investigate the practical viability of PRAM programming within the BSP framework. We argue that there is a necessity for PRAM computations in situations where the problem exhibits poor data locality. We introduce a C++ PRAM simulator that is built on top of the Oxford BSP Toolset, BSPlib, and provide a succinct PRAM language. Our approach achieves simplicity of programming over direct-mode BSP programming for reasonable overhead cost. We objectively compare optimised BSP algorithms with PRAM algorithms implemented with our C++ PRAM library and provide encouraging experimental results for the latter style of programming.
منابع مشابه
A PRAM oriented programming system
A PRAM-oriented programming language called 11 and its implementation on transputer networks are presented. The approach taken is a compromise between efficiency and simplicity. The 11 language has been conceived as a tool for the study, design, analysis, verification and teaching of parallel algorithms. A method for the complexity analysis of 11 programs called PRSW is introduced. The 11 compi...
متن کاملUNIVERSITY OF JOENSUU DEPARTMENT OF COMPUTER SCIENCE Report Series A An Implementation of the Programming Language pm2 for PRAM
pm2 is a programming language for PRAM. It is based on Modula-2 with additional elements for the control of parallelism. This report describes the main implementation concepts of pm2, mainly the usage of the PRAM. The compiler from pm2 to PRAM-assembler has been implemented. Processor and memory management of the implementation are simple but adequate and effective enough for the experimental c...
متن کاملEvaluating Parallel Algorithms Theoretical and Practical Aspects
The motivation for the work reported in this thesis has been to lessen the gap between theory and practice within the eld of parallel computing When looking for new and faster parallel algorithms for use in massively parallel systems it is tempting to investigate promising alternatives from the large body of research done on parallel algorithms within the eld of theoretical computer science The...
متن کاملPlasmonics and the Parallel Programming Problem
While many parallel computers have been built, it has generally been too difficult to program them. Now, all computers are effectively becoming parallel machines. Biannual doubling in the number of cores on a single chip, or faster, over the coming decade is planned by most computer vendors. Thus, the parallel programming problem is becoming more critical. The only known solution to the paralle...
متن کامل1 Models for Parallelalgorithm Design : An
In this chapter, we present three classical models used for the design of parallel algorithms: the PRAM (shared memory) model, the distributed memory model, and the coarse grained multicomputer model. Given a generic algorithm to solve a simple, but important, problem, we show its implementation on the diierent models in order to guide the reader through the very interesting task of parallel al...
متن کامل